Planning on Discrete Event Systems using parallelism maximization

This work deals with the production planning problem in Discrete Event Systems, using Supervisory Control Theory to establish search space and developing two heuristics based on maximization of parallelism find sequences that minimize makespan. The role is provide set all safe sequences, given by closed-loop behavior. are idea controllable events should be executed as soon they allowed (maximizing parallelism) but only temporally feasible candidates evaluated. proposed methodology delivers solutions robust uncertainties model parameters represent time intervals required for plant operations. Although heuristic procedures not guaranteed reach exact optimal general, we present a case study where it happens batch sizes. efficiency terms computation also illustrated study.